Multiset filters

Fast Dynamic Multiset Membership Testing Using Combinatorial Bloom Filters

In this paper we consider the problem of designing a data structure that can perform fast multiset membership testing in deterministic time. Our primary goal is to develop a hardware implementation of the data structure which uses only embedded memory blocks. Prior efforts to solve this problem involve hashing into multiple Bloom filters. Such approach needs a priori knowledge of the number of ...

Multiset rewriting by multiset onstraint solving

Properties of Multiset Language Classes Defined by Multiset Storage Automata

The previously introduced multiset language classes defined by multiset storage automata are being explored with respect to their closure properties and alternative characterizations.

Constraint Multiset

Semi-G-filters, Stonean filters, MTL-filters, divisible filters, BL-filters and regular filters in residuated lattices

At present, the filter theory of $BL$textit{-}algebras has been widelystudied, and some important results have been published (see for examplecite{4}, cite{5}, cite{xi}, cite{6}, cite{7}). In other works such ascite{BP}, cite{vii}, cite{xiii}, cite{xvi} a study of a filter theory inthe more general setting of residuated lattices is done, generalizing thatfor $BL$textit{-}algebras. Note that fil...